Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
نویسندگان
چکیده
منابع مشابه
Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
Non-Centered Discrete Gaussian sampling is a fundamental building block in many lattice-based constructions in cryptography, such as signature and identity-based encryption schemes. On the one hand, the center-dependent approaches, e.g. cumulative distribution tables (CDT), Knuth-Yao, the alias method, discrete Zigurat and their variants, are the fastest known algorithms to sample from a discre...
متن کاملGaussian Sampling in Lattice-Based Cryptography
Although rather recent, lattice-based cryptography has stood out on numer-ous points, be it by the variety of constructions that it allows, by its expectedresistance to quantum computers, of by its efficiency when instantiated on someclasses of lattices.One of the most powerful tools of lattice-based cryptography is Gaussiansampling. At a high level, it allows to prove the k...
متن کاملGaussian Sampling in Lattice Based Cryptography
Modern lattice-based cryptosystems require sampling from discrete Gaussian distributions. We review lattice based schemes and collect their requirements for sampling from discrete Gaussians. Then we survey the algorithms implementing such sampling and assess their practical performance. Finally we draw some conclusions regarding the best candidates for implementation on different platforms in t...
متن کاملGLITCH: A Discrete Gaussian Testing Suite for Lattice-based Cryptography
Lattice-based cryptography is one of the most promising areas within post-quantum cryptography, and offers versatile, efficient, and high performance security services. The aim of this paper is to verify the correctness of the discrete Gaussian sampling component, one of the most important modules within lattice-based cryptography. In this paper, the GLITCH software test suite is proposed, whic...
متن کاملSampling Discrete Gaussians Efficiently and Obliviously
In this work we construct an algorithm for sampling Discrete Gaussians efficiently and obliviously. Previously discrete Gaussian samplers have been constructed in [GPV08, Pei10], where the algorithms take as input a “high quality” basis and produce an output whose quality depends on the input basis quality. Our algorithm produces a discrete Gaussian of somewhat worse quality than [GPV08, Pei10]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2014
ISSN: 0938-1279,1432-0622
DOI: 10.1007/s00200-014-0218-3